Complexity Analysis: Finite Transformation Monoids
نویسندگان
چکیده
We examine the computational complexity of some problems from algebraic automata theory and from the field of communication complexity: testing Green’s relations (relations that are fundamental in monoid theory), checking the property of a finite monoid to have only Abelian subgroups, and determining the deterministic communication complexity of a regular language. By well-known algebraizations, these problems are closely linked with each other. We show that all of them are PSPACE-complete.
منابع مشابه
Recent results on syntactic groups of codes
Finite permutation groups can be considered as building blocks of finite transformation monoids. Indeed, by the Krohn-Rhodes Theorem, any finite transformation monoid divides a semidirect product of permutation groups and three element transformation monoids. Given a transformation monoid M on a finite set, defined by a finite set of generators, it is in general non-trivial to obtain a descript...
متن کاملMonoid generalizations of the Richard Thompson groups
The groups Gk,1 of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call Mk,1, and to inverse monoids, called Invk,1; this is done by simply generalizing bijections to partial functions or partial injective functions. The monoids Mk,1 have connections with circuit complexity (studied in another paper). Here we prove that Mk,1 and Invk,1 are congruence-s...
متن کاملA Theory of Transformation Monoids: Combinatorics and Representation Theory
The aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a monoid version of D. Higman’s celebrated theorem characterizing primitivity in terms of connectedness of orbital digraphs. A thorough study of the module (or repr...
متن کاملDescriptional Complexity of the Languages KaL: Automata, Monoids and Varieties
The first step when forming the polynomial hierarchies of languages is to consider languages of the form KaL where K and L are over a finite alphabet A and from a given variety V of languages, a ∈ A being a letter. All such KaL’s generate the variety of languages BPol1(V ). We estimate the numerical parameters of the language KaL in terms of their values for K and L. These parameters include th...
متن کاملFinite transducers for divisibility monoids
Divisibility monoids are a natural lattice-theoretical generalization of Mazurkiewicz trace monoids, namely monoids in which the distributivity of the involved divisibility lattices is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations. Here, we show that every divisibility monoid admits an explicit finite transducer which allows to c...
متن کامل